On finitely-valued Fuzzy Description Logics

On finitely-valued Fuzzy Description Logics

On Finitely Valued Fuzzy Description Logics: The Łukasiewicz Case

Following the guidelines proposed by Hájek in [1], some proposals of research on Fuzzy Description Logics (FDLs) were given in [2]. One of them consists in the definition and development of a family of description languages, each one having as underlying fuzzy logic the expansion with an involutive negation and truth constants of the logic defined by a divisible finite t-norm. A general framewo...

Conjunctive Query Answering in Finitely-Valued Fuzzy Description Logics

Fuzzy Description Logics (DLs) generalize crisp ones by providing membership degree semantics for concepts and roles. A popular technique for reasoning in fuzzy DL ontologies is by providing a reduction to crisp DLs and then employ reasoning in the crisp DL. In this paper we adopt this approach to solve conjunctive query (CQ) answering problems for fuzzy DLs. We give reductions for Gödel, and Ł...

Decidable Gödel Description Logics without the Finitely-Valued Model Property

In the last few years, there has been a large effort for analyzing the computational properties of reasoning in fuzzy description logics. This has led to a number of papers studying the complexity of these logics, depending on the chosen semantics. Surprisingly, despite being arguably the simplest form of fuzzy semantics, not much is known about the complexity of reasoning in fuzzy description ...

On Fuzzy Description Logics

The antecedents of DL languages are Network-based structures carrying the intuition that, by exploiting the notion of hierarchical structure, one could gain in terms of both ease of representation the efficiency of reasoning The basic elements of the representation are characterized as unary predicates, denoting sets of individuals, and binary predicates, denoting relationships between individu...